Minimum Area Polyomino Venn Diagrams
نویسندگان
چکیده
Polyomino Venn (or polyVenn) diagrams are Venn diagrams whose curves are the perimeters of polyominoes drawn on the integer lattice. Minimum area polyVenn diagrams are those in which each of the 2n intersection regions, in a diagram of n polyominoes, consists of exactly one unit square. We construct minimum area polyVenn diagrams in bounding rectangles of size 2r×2c whenever r, c ≥ 2. Our construction is inductive, and depends on two “expansion” results. First, a minimum area polyVenn in a 22×2c rectangle can be expanded to produce another one that fits into a 22×2c+3 bounding rectangle. Second, a minimum area polyVenn diagram in a 2r × 2c rectangle can be expanded to produce another one that fits into a 2r+1 × 2c+1 rectangle. Finally, for even n we construct n-set polyVenn diagrams in bounding rectangles of size (2n/2 − 1)× (2n/2 + 1) in which the empty set is not represented as a unit square.
منابع مشابه
Drawing Area-Proportional Venn and Euler Diagrams
We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-proportional Venn diagrams have an enhanced ability over traditional Venn diagrams to visually convey information about data sets with interacting characteristics. We develop algorithms for drawing area-proportional Ven...
متن کاملDrawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In these diagrams, the areas of the regions are in proportion to the given values. Venn-3, the Venn diagram consisting of three intersecting curves, has been used in many applications, including marketing, ecology and medicine. Whils...
متن کاملVenn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice Preliminary Draft
In this paper we show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, and prove that su...
متن کاملA Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex Set
In this short note using the method developed in [10] and [11], we construct a highly symmetrical, non-simple, attractive 7-Venn diagram. This diagram has the minimum number of vertices, 21. The only similar two, published in [1] and [11], di er from ours in many ways. One of them was found by computer search ([1]). Both of them are "necklace" type Venn diagrams (see [14] for de nition), but ou...
متن کاملUNSPECIFIED Some Results for Drawing Area Proportional Venn3 With Convex Curves
Many data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diagrams with three intersecting curves are considered useful for visualizing data in many applications, including bioscience, ecology and medicine. To ease the understanding of such diagrams, using restricted ‘nice’ shape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 3 شماره
صفحات -
تاریخ انتشار 2012